Towards Compile-Time Optimisations for Persistence

نویسندگان

  • Antony L. Hosking
  • J. Eliot B. Moss
چکیده

We consider how a persistent programming language might offer performance competitive with that of non-persistent languages, at least on memory resident data. We are concerned with object-oriented languages, and with implementing persistence via object faulting, where the system detects uses of non-resident objects and fetches them on demand. We present some background on object faulting and means for implementing it, and describe a specific language we are developing, namely Persistent Modula-3. Then we explore approaches to optimising persistence aspects of Persistent Modula-3, and outline techniques under consideration in our compiler development effort.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysing, Profiling and Optimising for Persistence

Orthogonally persistent programming languages1 provide improved support for the design, construction, maintenance and operation of applications that manage large bodies of long-lived, shared, structured data. Despite this, there is continued mainstream resistance to languages with orthogonal persistence due to a perception that they cannot deliver performance to match that of traditional progra...

متن کامل

Towards Compile-Time Optimizations for Persistence

We consider how a persistent programming language might offer performance competitive with that of non-persistent languages, at least on memory resident data. We are concernedwith object-oriented languages, and with implementing persistence via object faulting, where the system detects uses of non-resident objects and fetches them on demand. We present some background on object faulting and mea...

متن کامل

Towards Hybrid Array Types in SAC

Array programming is characterised by a formal calculus of (regular, dense) multidimensional arrays that defines the relationships between structural properties like rank and shape as well as data set sizes. Operations in the array calculus often impose certain constraints on the relationships of values or structural properties of argument arrays and guarantee certain relationships of values or...

متن کامل

Modular Control-Flow Analysis with Rank 2 Intersection Types

The performance of optimising compilers crucially depends on the availability of controlflow information at compile time. For any first-order imperative program, such information is available via a flowchart constructed from the program text. Consequently, traditional dataflow analyses can be used to perform a series of compile-time program optimisations (Aho et al. 1986). For higher-order prog...

متن کامل

An Eecient Distributed Tuple Space Implementation for Networks of Heterogenous Workstations

The distributed tuple space concept, on which the Linda process coordination model is founded, has given rise to several implementations on parallel machines and networks of heterogenous workstations. However, the fundamental techniques used in there systems have remained largely unchanged from the original Linda implementations. This paper describes a novel implementation which, using extensio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991